منابع مشابه
Efficient erasure correcting codes
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractions of nodes of different degrees on both sides of the graph which is necessary and sufficient for the decoding process to finish successfully...
متن کاملBlocking Intercalates In Sudoku Erasure Correcting Codes
A Sudoku grid is a square grid of size n, further subdivided into n mini-grids and into which the symbols 1, 2, . . . , n are placed such that each symbol appears exactly once in each row, column and mini-grid. It has been suggested that Sudoku puzzles may have applications in Coding Theory, specifically in the recovery of erasures [1, 2]. By encoding a message within a Sudoku grid, a received ...
متن کاملGeneric erasure correcting sets: Bounds and constructions
A generic (r,m)-erasure correcting set generates for each binary linear code of codimension r a collection of parity check equations that enables iterative decoding of all potentially correctable erasure patterns of size at most m. As we have shown earlier, such a set essentially is just a parity check collection with this property for the Hamming code of codimension r . We prove non-constructi...
متن کاملErasure coding for fault oblivious linear system solvers
Dealing with faults is an important problem as parallel and distributed systems scale to millions of processing cores. Traditional methods for dealing with faults include checkpoint-restart, active replicas, and deterministic replay. Each of these techniques has associated resource overheads and constraints. In this paper, we propose an alternate approach to dealing with faults based on input a...
متن کاملChannel-optimized scalar quantizers with erasure correcting codes
This paper investigates the design of channel-optimized scalar quantizers with erasure correcting codes over binary symmetric channels (BSC). A new scalar quantizer with uniform decoder and channel-optimized encoder aided by erasure correcting code is proposed. The lower bound for performance of the new quantizer with complemented natural code (CNC) index assignment is given. Then, in order to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2007
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2007.896540